This paper conducts studies on N order permutation of quasi-decreasing limitation, and gives a counting formula for N order quasi-decreasing permutation which satisfies the limitation. The stack technique in the computer science and combinatorial principle are used. 本文对具有准递减限制的n阶排列进行了研究,利用计算机科学中的堆栈(stack)技术和组合学原理,给出了满足这个限制的几阶准递减排列的计数公式。